Identifying reusable resources in digital reference answers
نویسندگان
چکیده
منابع مشابه
Rethinking Reusable Resources
We address the common and recurring problem of data reuse, focusing on the following topics: (i) the current state of affairs (in particular, problems with data); (ii) requirements for change; (iii) the proposed solution (its problems and advantages, as well as related work in this area), including the canonical-, I/O-, and data transformation models; (iv) maintenance issues; (v) implementation...
متن کاملTowards Reusable Linquistic Resources
i. The paper will try to identify the various concurrent factors which, in the last years, have contributed to the increasing attention paid to the issue of reusable linguistic resources for natural language processing. The role of various major Organisations (EEC, Council of Europe, DARPA, NEH, etc.) will be examined, taking into account the reasons which seem to have stimulated their active p...
متن کاملAcquiring Reusable Multilingual Phonotactic Resources
This paper presents a fully automatic procedure for acquiring reusable phonotactic resources from syllable annotated data. The procedure makes use of a regular inference algorithm and the acquired resources are stored in a specialised XML representation. The technique is then extended to support acquisition from phoneme labelled data while providing a semi-automatic annotation system assisting ...
متن کاملFinding Answers Using Resources in the Internet
In this paper we describe our experiments in finding answers from documents based on statistical and linguistic knowledge. We collected the candidate answers from sources available on the internet, and then we used them to validate the answers found in the documents. The candidate answers from the documents were found using a statistical technique and linguistic knowledge such as named entity t...
متن کاملIdentifying Certain Answers in Incomplete Databases
A database is incomplete if some tuples may be missing from some relations and only a part of each relation is known to be complete. The problem of determining whether a given query Q is complete over an incomplete database D is the answer-completeness problem and has been considered numerous time. This paper goes beyond the answer completeness problem to calculate the exact portion of the quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Society for Information Science and Technology
سال: 2008
ISSN: 0044-7870
DOI: 10.1002/meet.2008.1450450386